#include<bits/stdc++.h>
using namespace std;
#define maxn 101

struct Node
{
    int to,next;
}e[maxn];

int head[maxn]={0};
int low[maxn]={0};
int dfn[maxn]={0};
int cnt = 0,num = 0;

void add(int x,int y)
{
    e[++cnt].to = y;
    e[cnt].next = head[x];
    head[x] = cnt;
}
int root;
void tarjan(int u,int fa)
{
    dfn[u]=low[u]=++num;
    int count = 0;
    for(int i = head[u];i;i=e[i].next)
    {
        int v = e[i].to;
        if(v==fa)
        {
            continue;
        }
        if(!dfn[v])
        {
            tarjan(v,u);
            low[u]=min(low[u],low[v]);
            if(low[v]>=dfn[u])
            {
                count++;
                if(u!=root||count>1)
                {
                    cout<<u<<"是割点"<<endl;
                }
            }
        }
        else {
            low[u] = min(low[u],dfn[v]);
        }
    }
}

int main()
{
    int m,n;
    cin>>m>>n;
    int x,y;
    for(int i = 0;i<m;i++)
    {
        cin>>x>>y;
        add(x,y);
        add(y,x);
    }
    for(int i = 1;i<=n;i++)
    {
        if(!dfn[i])
        {
            root = i;
            tarjan(i,0);
        }
    }
}